Selection, Routing, and Sorting on the Star Graph
نویسندگان
چکیده
منابع مشابه
Selection, Routing, and Sorting on the Star Graph
We consider the problems of selection, routing and sorting on an n-star graph (with n! nodes), an interconnection network which has been proven to possess many special properties. We identify a tree like subgraph (which we call as a '(k, l, k) chain network') of the star graph which enables us to design efficient algorithms for the above mentioned problems. We present an algorithm that performs...
متن کاملEfficient sorting on the star graph interconnection network
Two algorithms for sorting n! numbers on an n-star interconnection network are described. Both algorithms are based on arranging the n! processors of the n-star in a virtual (n 1)-dimensional array. The rst algorithm runs in O(n logn) time. This performance matches that of the fastest previously known algorithm for the same problem. In addition to providing a new paradigm for sorting on the n-s...
متن کاملRandomized Routing, Selection, and Sorting on the OTIS-Mesh
The Optical Transpose Interconnection System (OTIS) is a recently proposed model of computing that exploits the special features of both electronic and optical technologies. In this paper we present efficient algorithms for packet routing, sorting, and selection on the OTISMesh. The diameter of an N-processor OTIS-Mesh is 4 √ N −3. We present an algorithm for routing any partial permutation in ...
متن کاملFault-Tolerant Routing on the Star Graph with Safety Vectors
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes. However, the distance measure cannot be applied on star graphs directly, since there are many routing path patterns when the distances of two pairs of nodes are the same. Thus, on star graphs, we define the safety ve...
متن کاملEfficient Sorting on the Star Graphinterconnection
Two algorithms for sorting n! numbers on an n-star interconnection network are described. Both algorithms are based on arranging the n! processors of the n-star in a virtual (n ? 1)-dimensional array. The rst algorithm runs in O(n 3 log n) time. This performance matches that of the fastest previously known algorithm for the same problem. In addition to providing a new paradigm for sorting on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1997
ISSN: 0743-7315
DOI: 10.1006/jpdc.1996.1297